Identifying codes in some subgraphs of the square lattice
نویسندگان
چکیده
An identifying code of a graph is a subset of vertices C such that the sets B(v) ∩ C are all nonempty and di,erent. In this paper, we investigate the problem of -nding identifying codes of minimum cardinality in strips and -nite grids. We -rst give exact values for the strips of height 1 and 2, then we give general bounds for strips and -nite grids. Finally, we give a sublinear algorithm which -nds the minimum cardinality of an identifying code in a restricted class of graphs which includes the grid. c © 2004 Elsevier B.V. All rights reserved.
منابع مشابه
The study of electronic conductance of a nanoribbon with square lattice including some impurities
In this paper, we study the electronic conductance of a nanoribbon with square lattice by using Green’s function theory within the tight-binding approach. For this purpose, we separate the conductance modes in the ideal parts by using a suitable unitary transformation in order to obtain the analytic formula for the corresponding self-energies. Then, we present a fast computer algorithm based on...
متن کاملTotal graph of a $0$-distributive lattice
Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...
متن کاملTrees and Matchings
In this article, Temperley’s bijection between spanning trees of a subgraph of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of an associated subgraph of the square grid on the other, is extended to the setting of general planar directed (and undirected) graphs, where edges carry nonnegative weights that induce a weighting on the set of spanning trees. W...
متن کاملOn identifying codes in lattices
Let G(V,E) be a simple, undirected graph. An identifying code on G is a vertex-subset C ⊆ V such that B(v) ∩ C is non-empty and distinct for each vertex v ∈ V , where B(v) is a ball about v. Motivated by applications to fault diagnosis in multiprocessor arrays, a number of researchers have considered the problem of constructing identifying codes of minimum density on various two-dimensional lat...
متن کاملIdentifying the Effective Ethical Codes on Urban Management with Meta Synthesis Method
Purpose: The compliance ethical characteristics plays an important role in urban management, and accordingly, the purpose of this study was identifying the effective ethical codes on urban management with a meta synthesis method. Methodology: This study in terms of purpose was applied and in terms of implementation method was qualitative. The field of research was all articles of effective eth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 319 شماره
صفحات -
تاریخ انتشار 2004